Turing’s algorithmic lens: From computability to complexity theory
نویسندگان
چکیده
منابع مشابه
Computability, Algorithmic Randomness and Complexity
I think mathematical ability manifests itself in many different ways. In particular, mathematicians can be drawn to space and geometry, can have strong analytic intuition, can be drawn to formalism, they can be drawn to counting arguments, etc. There is definitely no unique type of mathematician. Maybe those mathematicians who are drawn to algorithmic thinking have found a home in computer scie...
متن کاملComputability theory, algorithmic randomness and Turing's anticipation
This article looks at the applications of Turing’s Legacy in computation, particularly to the theory of algorithmic randomness, where classical mathematical concepts such as measure could be made computational. It also traces Turing’s anticipation of this theory in an early manuscript.
متن کاملGame Arguments in Computability Theory and Algorithmic Information Theory
We provide some examples showing how game-theoretic arguments (the approach that goes back to Lachlan and was developed by An. Muchnik) can be used in computability theory and algorithmic information theory. To illustrate this technique, we start with a proof of a classical result, the unique numbering theorem of Friedberg, translated to the game language. Then we provide game-theoretic proofs ...
متن کاملComplexity of Equivalence Relations and Preorders from Computability Theory
We study the relative complexity of equivalence relations and preorders from computability theory and complexity theory. Given binary relations R,S, a componentwise reducibility is defined by R ≤ S ⇐⇒ ∃f ∀x, y [xRy ↔ f(x)Sf(y)]. Here f is taken from a suitable class of effective functions. For us the relations will be on natural numbers, and f must be computable. We show that there is a Π1-comp...
متن کاملPriority Arguments in Computability Theory, Model Theory, and Complexity Theory
These notes present various priority arguments in classical computability theory, effective model theory, and complexity theory in a uniform style. Our notation usually follows Soare (1986) with some exceptions. We view Turing functionals as c.e. sets Φ of triples ⟨x, y, σ⟩, denoting that Φ(σ;x) ↓= y. (Of course, we have to impose the obvious compatibility condition, namely, that if ⟨x, y, σ⟩, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Arbor
سال: 2013
ISSN: 1988-303X,0210-1963
DOI: 10.3989/arbor.2013.764n6003